Connuence by Decreasing Diagrams
نویسنده
چکیده
We present a connuence criterion, local decreasingness, for abstract reduction systems. This criterion is shown to be a considerable generalisation of several well-known connuence criteria.
منابع مشابه
A Geometric Proof of Con uence by DecreasingDiagramsJan Willem Klop
The criterion for connuence using decreasing diagrams is a generalization of several well-known connuence criteria in abstract rewriting, such as the strong connuence lemma. We give a new proof of the decreasing diagram theorem based on a geometric study of innnite reduction diagrams , arising from unsuccessful attempts to obtain a connuent diagram by tiling with elementary diagrams.
متن کاملOn Connuence of Constraint Handling Rules on Connuence of Constraint Handling Rules
We introduce the notion of connuence for Constraint Handling Rules (CHR), a powerful language for writing constraint solvers. With CHR one simpliies and solves constraints by applying rules. Connuence guarantees that a CHR program will always compute the same result for a given set of constraints independent of which rules are applied. We give a decidable, suucient and necessary syntactic condi...
متن کاملSyntactic Connuence Criteria for Positive/negative-conditional Term Rewriting Systems
We study the combination of the following already known ideas for showing connuence of unconditional or conditional term rewriting systems into practically more useful connuence criteria for conditional systems: Our syntactic separation into constructor and non-constructor symbols, Huet's introduction and Toyama's generalization of parallel closedness for non-noetherian unconditional systems, t...
متن کاملConfluence by Decreasing Diagrams - Formalized
This paper presents a formalization of decreasing diagrams in the theorem prover Isabelle. It discusses mechanical proofs showing that any locally decreasing abstract rewrite system is confluent. The valley and the conversion version of decreasing diagrams are considered. 1998 ACM Subject Classification F.3.1, F.4.2
متن کاملOn Con uence of Constraint Handling
We introduce the notion of connuence for Constraint Handling Rules (CHR), a powerful language for writing constraint solvers. With CHR one simpliies and solves constraints by applying rules. Connuence guarantees that a CHR program will always compute the same result for a given set of constraints independent of which rules are applied. We give a decidable, suucient and necessary syntactic condi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994